A New Digital Signature Scheme Based on Two Hard Problems
نویسندگان
چکیده
In this paper, we propose a new signature scheme based on factoring and discrete logarithm. This scheme is based on two hard problems and provides higher level security as compare to a single hard problem. Most of the designated signature schemes are based on a single hard problem. Although these schemes secure but in a future if an enemy manages to solve this problem, are then he can recover all secret information including secret keys and parameters of the scheme. Our scheme is protected from such four attacks which are most common attacks for signature schemes.
منابع مشابه
The new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملA new digital signature scheme based on factoring and discrete logarithms
Problem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes a...
متن کاملA New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on fact...
متن کاملComments on Wei’s Digital Signature Scheme Based on Two Hard Problems
In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, at the same year, Li and Xiao demonstrated that Shao’s schemes are insecure are not based on any hard problem. Recently, Wei proposed two “Digital Signature Schemes Based on Two Hard Problems” to improve...
متن کاملNovel Digital Signature Schemes based on Factoring and Discrete Logarithms
In the paper, we propose a new digital signature scheme based on factoring and discrete logarithms. Specially, we prove that the security of the proposed signature scheme is based on both the security of the ElGamal signature scheme and the security of the modified OSS signature scheme. This is the first scheme which can be proved that its security is based on two hard problems. Like Meta-ElGam...
متن کامل